Fast Encoding of Polar Codes With Reed-Solomon Kernel
نویسندگان
چکیده
A low-complexity systematic encoding algorithm for polar codes with Reed-Solomon kernel is presented. The proposed method relies on fast Fourier transform based ReedSolomon encoding techniques. Application of polar codes in storage systems is considered.
منابع مشابه
Algebraic matching techniques for fast decoding of polar codes with Reed-Solomon kernel
We propose to reduce the decoding complexity of polar codes with non-Arikan kernels by employing a (near) ML decoding algorithm for the codes generated by kernel rows. A generalization of the order statistics algorithm is presented for soft decoding of Reed-Solomon codes. Algebraic properties of the Reed-Solomon code are exploited to increase the reprocessing order. The obtained algorithm is us...
متن کاملSoft-decision decoding of polar codes with Reed-Solomon kernels
The problem of efficient soft-decision decoding of polar codes with ReedSolomon kernel is considered. A decomposition of the kernel based on the cyclotomic FFT algorithm is proposed, which enables one to implement near-optimal evaluation of log-likelihood ratios in the successive cancellation decoding algorithm.
متن کاملA general construction of Reed-Solomon codes based on generalized discrete Fourier transform
In this paper, we employ the concept of the Generalized Discrete Fourier Transform, which in turn relies on the Hasse derivative of polynomials, to give a general construction of Reed-Solomon codes over Galois fields of characteristic not necessarily co-prime with the length of the code. The constructed linear codes enjoy nice algebraic properties just as the classic one.
متن کاملUsing concatenated algebraic geometry codes in channel polarization
Polar codes were introduced by Arikan [1] in 2008 and are the first family of error-correcting codes achieving the symmetric capacity of an arbitrary binary-input discrete memoryless channel under low complexity encoding and using an efficient successive cancellation decoding strategy. Recently, non-binary polar codes have been studied, in which one can use different algebraic geometry codes to...
متن کاملCollaborative Decoding of Interleaved Reed-Solomon Codes using Gaussian Elimination
We propose an alternative method for collaborative decoding of interleaved Reed-Solomon codes. Simulation results for a concatenated coding scheme using polar codes as inner codes are included.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IEEE Trans. Communications
دوره 64 شماره
صفحات -
تاریخ انتشار 2016